ABSTRACT
The standard bodies accepted elliptic curve cryptography as an efficient and alternative public key cryptosystem
for the next generation cryptographic applications. The most dominant operation in this cryptosystem is the scalar
multiplication. In this paper, we study various scalar multiplication algorithms with respect to the efficiency,
average hamming weight and memory requirements etc. This paper gives an idea and the areas for which the
researchers can proceed further.
Keywords: - Elliptic curve cryptography, binary method, non-adjacent form, scalar multiplication